A Kiefer–Wolfowitz comparison theorem for Wicksell’s problem

A Kiefer – Wolfowitz Comparison Theorem for Wicksell ’ S Problem

We extend the isotonic analysis for Wicksell's problem to estimate a regression function, which is motivated by the problem of estimating dark matter distribution in astronomy. The main result is a version of the Kiefer–Wolfowitz theorem comparing the empirical distribution to its least concave majorant, but with a convergence rate n −1 log n faster than n −2/3 log n. The main result is useful ...

Bernstein's Comparison Theorem and a Problem O[ Braess

A Transfer Theorem for the Separation Problem

We investigate two problems for a class C of regular word languages. The C-membership problem asks for an algorithm to decide whether an input language belongs to C. The C-separation problem asks for an algorithm that, given as input two regular languages, decides whether there exists a third language in C containing the first language, while being disjoint from the second. These problems are c...

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

A Compactness Theorem for the Yamabe Problem

In this paper, we prove compactness for the full set of solutions to the Yamabe Problem if n ≤ 24. After proving sharp pointwise estimates at a blowup point, we prove the Weyl Vanishing Theorem in those dimensions, and reduce the compactness question to showing positivity of a quadratic form. We also show that this quadratic form has negative eigenvalues if n ≥ 25.